Random graphs

Results: 338



#Item
121

Spanning Trees in Random Graphs Richard Montgomery (University of Cambridge) Given a tree T with n vertices, how large does p need to be for it to be likely that a copy of T appears in the binomial random graph G(n, p)?

Add to Reading List

Source URL: web.mat.bham.ac.uk

- Date: 2014-10-09 03:30:03
    122

    Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs Frantiˇsek Kardoˇs ∗ Daniel Kr´al’†

    Add to Reading List

    Source URL: iti.mff.cuni.cz

    Language: English - Date: 2016-02-04 05:53:38
      123Graph theory / Mathematics / Discrete mathematics / Directed graph / Graph / Random graph / Expander graph / Adjacency matrix / Connectivity / Line graph

      On the Mixing Time of Directed Social Graphs and Security Implications Abedelaziz Mohaisen Huy Tran

      Add to Reading List

      Source URL: www-users.cs.umn.edu

      Language: English - Date: 2012-04-20 11:44:08
      124

      Submitted to the Annals of Applied Probability VIRAL PROCESSES BY RANDOM WALKS ON RANDOM REGULAR GRAPHS By Mohammed Abdullah†,∗ , Colin Cooper‡ and Moez Draief†,∗ Imperial College London† and King’s Colleg

      Add to Reading List

      Source URL: www.mohammedabdullah.com

      Language: English - Date: 2015-10-03 15:59:04
        125Network theory / Graph theory / Networks / Random graphs / Network analysis / Random geometric graph / Scale-free network / Evolving networks / Degree distribution / Clustering coefficient / Topology / Connectivity

        Spatial models for virtual networks Jeannette Janssen Dalhousie University, Halifax, NS, B3H 3J5, Canada Abstract. This paper discusses the use of spatial graph models for the analysis of networks that do not have a dire

        Add to Reading List

        Source URL: www.mathstat.dal.ca

        Language: English - Date: 2010-04-12 12:33:14
        126Graph theory / Mathematics / Discrete mathematics / Graph / Degree / Connectivity / Planar separator theorem / Centrality

        PROTEAN GRAPHS WITH A VARIETY OF RANKING SCHEMES JEANNETTE JANSSEN AND PAWEÃL PRAÃLAT Abstract. We introduce a new class of random graph models for complex realworld networks, based on the protean graph model by L Ã u

        Add to Reading List

        Source URL: www.mathstat.dal.ca

        Language: English - Date: 2010-03-02 15:58:00
        127

        Social Network Analysis of Clustering in Random Geometric Graphs Christine Marshall, James Cruickshank and Colm O’Riordan National University of Ireland, Galway1 Figure 1: Subfigures a) and b) show the relationship bet

        Add to Reading List

        Source URL: womencourage.acm.org

        Language: English - Date: 2016-02-05 15:45:18
          128

          Coloring random graphs online without creating monochromatic subgraphs 1 Torsten Mütze

          Add to Reading List

          Source URL: www.cadmo.ethz.ch

          Language: English
            129

            Small subgraphs in random graphs and the power of multiple choices Torsten Mütze Reto Spöhel∗

            Add to Reading List

            Source URL: www.cadmo.ethz.ch

            Language: English
              130

              Random directed graphs are robustly Hamiltonian Dan Hefetz ∗ Angelika Steger

              Add to Reading List

              Source URL: web.mat.bham.ac.uk

              Language: English - Date: 2014-04-29 05:02:30
                UPDATE